Что (кто) такое recursive data types - определение
A DATA TYPE THAT REFERS TO ITSELF IN ITS DEFINITION
Isorecursive type; Isorecursive; Equirecursive; Equirecursive type; Recursive type; Recursive data structure; Inductively-defined data type; Recursive datatype; Recursively-defined data type; Inductive data type (recursive data); Recursive data; Mutually recursive data type
Recursive data type
In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs.
recursive type
A data type which contains itself. The commonest example is
the list type, in Haskell:
data List a = Nil | Cons a (List a)
which says a list of a's is either an empty list or a {cons
cell} containing an 'a' (the "head" of the list) and another
list (the "tail").
Recursion is not allowed in Miranda or Haskell {synonym
types}, so the following Haskell types are illegal:
type Bad = (Int, Bad)
type Evil = Bool -> Evil
whereas the seeminly equivalent algebraic data types are
acceptable:
data Good = Pair Int Good
data Fine = Fun (Bool->Fine)
General recursive function
ONE OF SEVERAL EQUIVALENT DEFINITIONS OF A COMPUTABLE FUNCTION
Partial recursive function; Total recursive function; Mu-recursive; Mu recursive function; Mu-recursive function; Recursive function theory; M-recursive function; Μ recursion; General-recursive; General recursive; Recursive function (computability); Μ-recursive function; Μ-recursive
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function).
Википедия
Recursive data type
In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs.
An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.
Sometimes the term "inductive data type" is used for algebraic data types which are not necessarily recursive.
